Approximate compaction and padded - sortingon
نویسنده
چکیده
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, padded-sorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is dramatically lower than time complexity of sorting. We analyze time complexity of these problems on CREW PRAMs (deterministic and randomized) and get tight lower und upper bounds depending on the size of free space. We extend our lower bounds to approximate compaction and compression.
منابع مشابه
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, paddedsorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of ...
متن کاملThe Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
The random-adversary technique is a general method for proving lower bounds on randomized parallel algorithms. The bounds apply to the number of communication steps, and they apply regardless of the processors’ instruction sets, the lengths of messages, etc. This paper introduces the random-adversary technique and shows how it can be used to obtain lower bounds on randomized parallel algorithms...
متن کاملIntroducing Padded Wall to Reduce Sloshing Induced Wall Pressure in Water Storage Tanks
Sloshing due to ground motion develops large pressure on the walls of water retaining tanks. This paper evaluates the efficacy of padded walls on the reduction of sloshing effects in rectangular water storage tanks subjected to ground motion. An analytical solution based on velocity potential function is provided to obtain the response of rigid and padded wall tanks in terms of the wave elevat...
متن کاملLower Bounds for Padded Sorting and Approximate Counting
We examine the relationship between running time and error of parallel sorting algorithms. This is done by applying Hastad's main lemma to relate the size depth and error of simple circuits, that sort an input of 0's and 1's. As a consequence, we obtain lower bounds for approximate counting as well.
متن کاملWaste Makes Haste: Tight Bounds for Loose Parallel Sorting
Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take fl(log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more "wasteful" convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1 + o(1))n. We give very fast randomized CRCW PRAM algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007